The Two-Point Fano and Ideal Binary Clutters
نویسندگان
چکیده
Let F be a binary clutter. We prove that if F is non-ideal, then either F or its blocker b(F) has one of L7,O5,LC7 as a minor. L7 is the non-ideal clutter of the lines of the Fano plane, O5 is the non-ideal clutter of odd circuits of the complete graph K5, and the two-point Fano LC7 is the ideal clutter whose sets are the lines, and their complements, of the Fano plane that contain exactly one of two fixed points. In fact, we prove the following stronger statement: if F is a minimally non-ideal binary clutter different from L7,O5, b(O5), then through every element, either F or b(F) has a two-point Fano minor.
منابع مشابه
Deltas, delta minors and delta free clutters
For an integer n ≥ 3, the clutter ∆n := { {1, 2}, {1, 3}, . . . , {1, n}, {2, 3, . . . , n} } is called a delta of dimension n, whose members are the lines of a degenerate projective plane. In his seminal paper on non-ideal clutters, Alfred Lehman manifested the role of the deltas as a distinct class of minimally non-ideal clutters [DIMACS, 1990]. A clutter is delta free if it has no delta mino...
متن کاملOn Combinatorial Properties of Binary Spaces
Abs t rac t . A binary clutter is the family of inclusionwise minimal supports of vectors of affine spaces over GF(2). Binary clutters generalize various objects studied in Combinatorial Optimization, such as paths, Chinese Postman Tours, multiflows and one-sided circuits on surfaces. The present work establishes connections among three matroids associated with binary clutters, and between any ...
متن کاملIdeal Binary Clutters, Connectivity, and a Conjecture of Seymour
A binary clutter is the family of odd circuits of a binary matroid, that is, the family of circuits that intersect with odd cardinality a fixed given subset of elements. Let A denote the 0;1 matrix whose rows are the characteristic vectors of the odd circuits. A binary clutter is ideal if the polyhedron fx 0 : Ax 1g is integral. Examples of ideal binary clutters are st-paths, st-cuts, T -joins ...
متن کاملIdeal Binary Clutters, Connectivity, and a Conjecture of Seymour
A binary clutter is the family of odd circuits of a binary matroid, that is, the family of circuits that intersect with odd cardinality a fixed given subset of elements. Let A denote the 0;1 matrix whose rows are the characteristic vectors of the odd circuits. A binary clutter is ideal if the polyhedron fx 0 : Ax 1g is integral. Examples of ideal binary clutters are st-paths, st-cuts, T -joins ...
متن کاملOn Ideal Clutters, Metrics and Multiflows
Abs t rac t . "Binary clutters" contain various objects studied in Combinatorial Optimization, such as paths, Chinese Postman Tours, multiflows and one-sided circuits on surfaces. Minimax theorems about these can be generalized in terms of ideal binary clutters. Seymour has conjectured a characterization of these, and the goal of the present work is to study this conjecture in terms of multiflo...
متن کامل